The fastest evolutionary trajectory.

نویسندگان

  • Arne Traulsen
  • Yoh Iwasa
  • Martin A Nowak
چکیده

Given two mutants, A and B, separated by n mutational steps, what is the evolutionary trajectory which allows a homogeneous population of A to reach B in the shortest time? We show that the optimum evolutionary trajectory (fitness landscape) has the property that the relative fitness increase between any two consecutive steps is constant. Hence, the optimum fitness landscape between A and B is given by an exponential function. Our result is precise for small mutation rates and excluding back mutations. We discuss deviations for large mutation rates and including back mutations. For very large mutation rates, the optimum fitness landscape is flat and has a single peak at type B.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Approximate Pareto Optimal Solutions of Multi objective Optimal Control Problems by Evolutionary Algorithms

In this paper an approach based on evolutionary algorithms to find Pareto optimal pair of state and control for multi-objective optimal control problems (MOOCP)'s is introduced‎. ‎In this approach‎, ‎first a discretized form of the time-control space is considered and then‎, ‎a piecewise linear control and a piecewise linear trajectory are obtained from the discretized time-control space using ...

متن کامل

A MODEL FOR EVOLUTIONARY DYNAMICS OF WORDS IN A LANGUAGE

Human language, over its evolutionary history, has emerged as one of the fundamental defining characteristic of the modern man. However, this milestone evolutionary process through natural selection has not left any ’linguistic fossils’ that may enable us to trace back the actual course of development of language and its establishment in human societies. Lacking analytical tools to fathom the cr...

متن کامل

The Fastest Arbitrary k-space Trajectories

Introduction: We present a method to compute the fastest possible gradient waveforms for a given k-space trajectory. In our design, we exploit the fact that each gradient set has its own limitation. This is an extension of our previous method described in [1]. In that solution, the worst-case magnitude gradient and slew constraints were considered. This has the advantage of resulting in wavefor...

متن کامل

Minimum Time Kinematic Trajectories for Self-propelled Rigid Bodies in the Unobstructed Plane

The problem of moving rigid bodies efficiently is of particular interest in robotics because the simplest model of a mobile robot or of a manipulated object is often a rigid body. Path planning, controller design and robot design may all benefit from precise knowledge of optimal trajectories for a set of permitted controls. In this work, we present a general solution to the problem of finding m...

متن کامل

Learning Mobile Robot Behaviours by Discovering Associations Between Input Vectors and Trajectory Velocities

In this paper, we describe a reinforcement robot learning method which enables a mobile robot to simultaneously acquire the ability to avoid objects, follow walls and control its velocity as a result of interacting with its environment. Our approach differs to conventional reinforcement learning approaches in that the robot learns associations between input vectors and trajectory velocities rat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Journal of theoretical biology

دوره 249 3  شماره 

صفحات  -

تاریخ انتشار 2007